Factorizations in evaluation monoids of Laurent semirings
نویسندگان
چکیده
For a positive real number $\alpha$, let $\mathbb{N}_0[\alpha,\alpha^{-1}]$ be the semiring of all numbers $f(\alpha)$ for $f(x)$ lying in $\mathbb{N}_0[x,x^{-1}]$, which is Laurent polynomials over set nonnegative integers $\mathbb{N}_0$. In this paper, we study various factorization properties additive structure $\mathbb{N}_0[\alpha, \alpha^{-1}]$. We characterize when \alpha^{-1}]$ atomic. Then satisfies ascending chain condition on principal ideals terms certain well-studied properties. Finally, unique property and show that, not case, has infinite elasticity.
منابع مشابه
evaluation of sadr eminence in safavid period
چکیده: یکی از دوره های مهم تاریخی ایران به لحاظ تأمین استقلال ملی مذهبی و حتی تأثیر آن بر فرهنگ و مذهب ایرانیان، دوره صفویه است. رسمیت دادن و رواج مذهب شیعه توسط شاه اسماعیل اول، یکی از مهمترین اقدامات این دولت محسوب می شود. بنابراین برای اجرای این سیاست، وی منصب صدارت را به عنوان منصبی مذهبی- حکو متی ایجاد کرد .این منصب از دوره ی تیموریان ایجاد شده بود ولی در اواخر این دوره اهمیت بیشتری یافت...
15 صفحه اولFactorizations of Algebraic Integers, Block Monoids, and Additive Number Theory
Let D be the ring of integers in a finite extension of the rationals. The classic examination of the factorization properties of algebraic integers usually begins with the study of norms. In this paper, we show using the ideal class group, C(D), of D that a deeper examination of such properties is possible. Using the class group, we construct an object known as a block monoid, which allows us t...
متن کاملTransitive factorizations of free partially commutative monoids and Lie algebras
Let M(A, θ) be a free partially commutative monoid. We give here a necessary and sufficient condition on a subalphabet B ⊂ A such that the right factor of a bisection M(A, θ) = M(B, θB).T be also partially commutative free. This extends strictly the (classical) elimination theory on partial commutations and allows to construct new factorizations of M(A, θ) and associated bases of LK(A, θ).
متن کاملCircuit Evaluation for Finite Semirings
The computational complexity of the circuit evaluation problem for finite semirings is considered, where semirings are not assumed to have an additive or multiplicative identity. The following dichotomy is shown: If a finite semiring is such that (i) the multiplicative semigroup is solvable and (ii) it does not contain a subsemiring with an additive identity 0 and a multiplicative identity 1 6=...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Algebra
سال: 2022
ISSN: ['1532-4125', '0092-7872']
DOI: https://doi.org/10.1080/00927872.2021.2018449